Measures related to $(\epsilon,n)$-complexity functions
نویسندگان
چکیده
منابع مشابه
Measures related to (ǫ, n)-complexity functions
The (ǫ, n)-complexity functions describe total instability of trajectories in dynamical systems. They reflect an ability of trajectories going through a Borel set to diverge on the distance ǫ during the time interval n. Behavior of the (ǫ, n)-complexity functions as n → ∞ is reflected in the properties of special measures. These measures are constructed as limits of atomic measures supported at...
متن کاملComplexity Measures of Cryptographically Secure Boolean Functions
In stream cipher cryptography a pseudorandom sequence of bits of length equal to the message length is generated. This sequence is then bitwise XORed (addition modulo 2) with the message sequence and the resulting sequence is transmitted. At the receiving end, deciphering is done by generating the same pseudorandom sequence and bitwise XORing the cipher bits with the random bits. The seed of th...
متن کاملInformation Measures via Copula Functions
In applications of differential geometry to problems of parametric inference, the notion of divergence is often used to measure the separation between two parametric densities. Among them, in this paper, we will verify measures such as Kullback-Leibler information, J-divergence, Hellinger distance, -Divergence, … and so on. Properties and results related to distance between probability d...
متن کاملOn Some Communication Complexity Problems Related to THreshold Functions
We study the computation of threshold functions using formulas over the basis fAND, OR, NOTg, with the aim of unifying the lower bounds of Hansel, Krichevskii, and Khrapchenko. For this we consider communication complexity problems related to threshold function computation. We obtain an upper bound for a communication problem used by Karchmer and Wigderson to derive the depth version of the Khr...
متن کاملOn the parity complexity measures of Boolean functions
The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement. We also show that they are polynomially related to an analogue of the block sensitivity. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Dynamical Systems
سال: 2008
ISSN: 1078-0947
DOI: 10.3934/dcds.2008.22.23